//
// Created by Xu Xiao on 2022/9/23.
//

#ifndef ALGORITHM_22_1_SLN_T_Q2566_H
#define ALGORITHM_22_1_SLN_T_Q2566_H

#include <iostream>
#include <cstring>
#include <climits>
#include <unordered_map>

using namespace std;

class Sln_T_Q2566 {
private:
    int n, m;
    bool availablePos[55];

    void search(int i, int pos) {
        if (pos <= 0 || pos >= n) return;
        availablePos[pos] = true;
        search(i + 1, pos + (2 * i - 1));
        search(i + 1, pos - (2 * i - 1));
    }

public:
    Sln_T_Q2566() {
        while (cin >> n >> m) {
            if (n == 0 && m == 0) break;
            if (n >= 50) {
                cout << "Let me try!\n";
                continue;
            }
            memset(availablePos, false, sizeof(availablePos));
            search(2, 1);
            if (availablePos[m]) {
                cout << "Let me try!\n";
            } else {
                cout << "Don't make fun of me!\n";
            }
        }
    }

};


#endif //ALGORITHM_22_1_SLN_T_Q2566_H
